Volumetric depth peeling for virtual arthroscopy

نویسندگان

  • David Borland
  • John P. Clarke
چکیده

Three dimensional (3D) display of medical data sets is an increasingly useful tool. Viewing 3D reconstructions of objects from magnetic resonance imaging (MRI) and computerized tomography (CT) data is more natural and intuitive than mentally reconstructing these objects from orthogonal slices of the data, especially with the increase in size of datasets due to improving scanner resolutions. When displaying such data sets using volume rendering, appropriate selection of the transfer function is critical for determining which features of the data will be displayed. For virtual arthroscopy, however, no transfer function can enable views like that of a socket from within the ball of a joint because the ball itself blocks the view. Volumetric depth peeling (VDP) was developed to enable the rapid survey of joints for pathology by automatically culling occluding voxels, thus enabling textbook-like illustrations of joint surfaces that are not possible even with clinical arthroscopy (see Figure 1). VDP borrows conceptually from previous work, but is extended to the more general case of ray-based volume rendering, retaining full transfer-function control. Arthroscopy Arthroscopy is the process of inserting an arthroscope (a small camera) into a joint through an incision in the skin and so providing views of the interior of the joint. The technique is useful for diagnosing derangements within the joint and for performing surgery to treat them. However, arthroscopy is an expensive, invasive procedure that requires skilful manipulation of arthroscopic tools confined to the cramped spaces within joints. For preand post-operative diagnosis of joint derange

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Volumetric depth peeling for medical image display

Volumetric depth peeling (VDP) is an extension to volume rendering that enables display of otherwise occluded features in volume data sets. VDP decouples occlusion calculation from the volume rendering transfer function, enabling independent optimization of settings for rendering and occlusion. The algorithm is flexible enough to handle multiple regions occluding the object of interest, as well...

متن کامل

Virtual Pyeloscopy Using Volumetric Depth Peeling1

Rationale and Objectives. The aim of the study is to test a new volume-rendering method, volumetric depth peeling (VDP), for use in virtual pyeloscopy. Materials and Methods. VDP was applied to axial contrast-enhanced source computed tomographic (CT) images and coronal reformatted maximum intensity projections of three contrast-filled gloves containing objects of varying density. Similar render...

متن کامل

Volumetric Depth Peeling on Graphics Hardware

The increasing programmability of modern graphics hardware enables acceleration of rendering methods other than traditional rasterization. In this paper, we discuss the implementation of a ray casting-based volume renderer on graphics hardware using vertex and fragment programs. We also show how ray casting on hardware enables easy implementation of volume rendering extensions that make use of ...

متن کامل

Depth-Peeling for Texture-Based Volume Rendering

We present the concept of volumetric depth-peeling. The proposed method is conceived to render interior and exterior iso-surfaces for a fixed iso-value and to blend them without the need to render the volume multiple times. The main advantage of our method over pre-integrated volume rendering is the ability to extract arbitrarily many iso-layers for the given iso-value. Up to now, pre-integrate...

متن کامل

Interactive Order-Independent Transparency

Correctly rendering non-refractive transparent surfaces with core OpenGL functionality [9] has the vexing requirements of depth-sorted traversal and nonintersecting polygons. This is frustrating for most application developers using OpenGL because the natural order of scene traversal (usually one object at a time) rarely satisfies these requirements. Objects can be complex, with their own trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005